Linear dependence of quasi-periods over the rationals
نویسندگان
چکیده
In this note we shall show that a lattice ℤω 1 +ℤω 2 in ℂ has ℚ-linearly dependent quasi-periods if and only ω /ω is equivalent to zero of the Eisenstein series E under action SL (ℤ) on upper half plane ℂ.
منابع مشابه
Solving Binary Linear Equation Systems over the Rationals and Binaries
This paper presents intermediate results of our investigations into the potential of analog hardware for the purpose of solving linear equation (LES) systems which are of quadratic form and binary. Based on the assumption that we can efficiently solve binary LES over the rationals with sufficient precision, we present a generic method to map a rational solution to a solution which solves the eq...
متن کاملGeometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given points lie on one side of a query line. We show that with polynomial storage the query time is Θ(log b/ log log b), where b is the bit length of the rationals used in specifying the line and the points. The lower bou...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولDecidability of the interval temporal logic AABB over the rationals
The classification of the fragments of Halpern and Shoham’s logic with respect to decidability/undecidability of the satisfiability problem is now very close to the end. We settle one of the few remaining questions concerning the fragment AĀBB̄, which comprises Allen’s interval relations “meets” and “begins” and their symmetric versions. We already proved that AĀBB̄ is decidable over the class of...
متن کاملThe complexity of factoring univariate polynomials over the rationals
This tutorial will explain the algorithm behind the currently fastest implementations for univariate factorization over the rationals. The complexity will be analyzed; it turns out that modifications were needed in order to prove a polynomial time complexity while preserving the best practical performance. The complexity analysis leads to two results: (1) it shows that the practical performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2021
ISSN: ['1631-073X', '1778-3569']
DOI: https://doi.org/10.5802/crmath.171